Randomized Online Scheduling with Delivery Times

نویسنده

  • Steven S. Seiden
چکیده

We study one of the most basic online scheduling models, online one machine scheduling with delivery times where jobs arrive over time. We provide the rst randomized algorithm for this model, show that it is 1.55370-competitive and show that this analysis is tight. The best possible deterministic algorithm is 1:61803-competitive. Our algorithm is a distribution between two deterministic algorithms. We show that any such algorithm is no better than 1.5-competitive. To our knowledge, this is the rst lower bound proof for a distribution between two deterministic algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomized On-Line scheduling similar jobs to minimize makespan on two identical processors

In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without preemption. The objective is to minimize makespan. We devise a randomized on-line algorithm for this problem along with a lower bound.

متن کامل

A best on-line algorithm for single machine scheduling with small delivery times

We consider a single machine on-line scheduling problem with delivery times. All jobs arrive over time. Each job’s characteristics, such as processing time and delivery time, become known at its arrival time. Once the processing of a job is completed we deliver it to the destination by a vehicle. The objective is to minimize the time by which all jobs have been delivered. In this paper, we assu...

متن کامل

Randomized algorithms for on-line scheduling problems: how low can't you go?

vVe prove lower bounds on the competitive ratio of randomized algorithms for several on-line scheduling problems. The main result is a bound of ej(e 1) for the on-line problem with objective minimizing the sum of completion times of jobs that arrive over time at their release times and are to be processed on a single machine. This lower bound shows that a randomized algorithm designed in [Cheku...

متن کامل

Asac 2004 On-line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors with or without preemption. The objective is to minimize makespan. For the preemptive version of the problem, we present a best possible deterministic on-line scheduling algorithm along with a...

متن کامل

Minimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Optim.

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1999